A Survey of Feedback with Carry Shift Registers

نویسنده

  • Andrew Klapper
چکیده

Feedback with carry shift registers (FCSRs) are arithmetic analogs of linear feedback shift registers (LFSRs). In this paper we survey some of the basic properties of FCSRs. For comparison, we first review some basic facts about LFSRs. We then define FCSRs and discuss their relation to the N -adic numbers. This leads to the analysis of periodicity of FCSR sequences, their exponential representation, and a description of maximal period FCSR sequences. We also discuss an arithmetic analog of cross-correlations, the FCSR register synthesis problem, and how FCSRs can be efficiently implemented in parallel architecture.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fibonacci and Galois representations of feedback-with-carry shift registers

Feedback with carry shift registers (FCSRs) are a class of finite state devices that are similar to linear feedback shift registers (LFSRs) in their simplicity and statistical randomness, and in that they have algebraic tools for the analysis of their output. In this paper we describe and analyze an alternative architecture for FCSRs that is similar to the Galois architecture for LFSRs. We also...

متن کامل

Register Synthesis for Algebraic Feedback Shift Registers Based on Non-Primes

In this paper, we describe a solution to the register synthesis problem for a class of sequence generators known as Algebraic Feedback Shift Registers. These registers are based on the algebra of π-adic numbers, where π is an element in a ring R, and produce sequences of elements in R/(π). We give several cases where the register synthesis problem can be solved by an efficient algorithm. Conseq...

متن کامل

Feedback with Carry Shift Registers over Z/(N)

For any integer N > 1, we construct feedback with carry shift registers over Z/(N) (N -FCSRs). The case when N is a prime, was investigated by Klapper and Goresky [1, 2]. We present the basic properties of N -FCSRs. We solve the register synthesis problem: given a small number of symbols of a sequence over Z/(N) synthesize the smallest N -FCSR that outputs the sequence.

متن کامل

Large Period Nearly deBruijn FCSR Sequences ( Extended

Recently, a new class of feedback shift registers (FCSRs) was introduced, based on algebra over the 2-adic numbers. The sequences generated by these registers have many algebraic properties similar to those generated by linear feedback shift registers. However, it appears to be significantly more difficult to find maximal period FCSR sequences. Jn this paper we exhibit a tpchnique for easily fi...

متن کامل

Large Period Nearly deBruijn FCSR Sequences

Recently, a new class of feedback shift registers (FCSRs) was introduced, based on algebra over the 2-adic numbers. The sequences generated by these registers have many algebraic properties similar to those generated by linear feedback shift registers. However, it appears to be significantly more difficult to find maximal period FCSR sequences. In this paper we exhibit a technique for easily fi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004